DotKnot: pseudoknot prediction using the probability dot plot under a refined energy model
نویسندگان
چکیده
RNA pseudoknots are functional structure elements with key roles in viral and cellular processes. Prediction of a pseudoknotted minimum free energy structure is an NP-complete problem. Practical algorithms for RNA structure prediction including restricted classes of pseudoknots suffer from high runtime and poor accuracy for longer sequences. A heuristic approach is to search for promising pseudoknot candidates in a sequence and verify those. Afterwards, the detected pseudoknots can be further analysed using bioinformatics or laboratory techniques. We present a novel pseudoknot detection method called DotKnot that extracts stem regions from the secondary structure probability dot plot and assembles pseudoknot candidates in a constructive fashion. We evaluate pseudoknot free energies using novel parameters, which have recently become available. We show that the conventional probability dot plot makes a wide class of pseudoknots including those with bulged stems manageable in an explicit fashion. The energy parameters now become the limiting factor in pseudoknot prediction. DotKnot is an efficient method for long sequences, which finds pseudoknots with higher accuracy compared to other known prediction algorithms. DotKnot is accessible as a web server at http://dotknot.csse.uwa.edu.au.
منابع مشابه
Heuristic RNA pseudoknot prediction including intramolecular kissing hairpins.
Pseudoknots are an essential feature of RNA tertiary structures. Simple H-type pseudoknots have been studied extensively in terms of biological functions, computational prediction, and energy models. Intramolecular kissing hairpins are a more complex and biologically important type of pseudoknot in which two hairpin loops form base pairs. They are hard to predict using free energy minimization ...
متن کاملPredicting pseudoknotted structures across two RNA sequences
MOTIVATION Laboratory RNA structure determination is demanding and costly and thus, computational structure prediction is an important task. Single sequence methods for RNA secondary structure prediction are limited by the accuracy of the underlying folding model, if a structure is supported by a family of evolutionarily related sequences, one can be more confident that the prediction is accura...
متن کاملComputational Approaches for determination of Most Probable RNA Secondary Structure Using Different Thermodynamics Parameters
Many bioinformatics studies require the analysis of RNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D folding structures of RNA. The core of RNA structure is a dynamic programming algorithm to predict RNA secondary structures from sequence based on the principle of minimizing free energy. In this paper the thermodynamic data have...
متن کاملSparsification Enables Predicting Kissing Hairpin Pseudoknot Structures of Long RNAs in Practice
While computational RNA secondary structure prediction is an important tool in RNA research, it is still fundamentally limited to pseudoknot-free structures (or at best very simple pseudoknots) in practice. Here, we make the prediction of complex pseudoknots – including kissing hairpin structures – practically applicable by reducing the originally high space consumption. For this aim, we apply ...
متن کاملModification of the saffron model for growth and yield prediction under different irrigation water salinity, manure application and planting methods
The Saffron Yield Estimation Model (SYEM) was modified for salinity conditions, cowmanure application and planting methods using two-year experiments data in Badjgah region ofIran. A split-split plot arrangement was conducted in complete randomized block design duringtwo years with irrigation water salinity levels (0.45 (fresh water, S1), 1.0 (S2), 2.0 (S3) and 3.0(S4) dS m-1) as the main plot,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 38 شماره
صفحات -
تاریخ انتشار 2010